Allocation of effective maintenance limit for railway track geometry
نویسندگان
چکیده
منابع مشابه
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programming formulations for this problem: a standard formulation that models block conflicts in terms of packing constraints, and a novel formulation of the ‘extended’ type that is based on additional ‘configuration’ variables....
متن کاملInfluences of Railway Track Geometry Parameters on Ground-Borne Vibration
One of the most important challenges in the development of urban railways network is the effects of railway vibrations on human and adjacent structures. Although various investigations into the sources of railway vibrations have been conducted, very few research works have been reported on the influences of track geometry parameters on the level of vibrations. This is addressed in this resea...
متن کاملRemarks on Modern Track Geometry Maintenance
A short survey on modern track maintenance methods is given, concentrating on the developments in recent years. The ongoing refinement of the machinery should be shown as the influence of IT-solutions. On top the economic view to the track infrastructure is briefly demonstrated. Further developments in track hardware solutions must respect the obtained high level of track work mechanization. H...
متن کاملRailway Track Allocation
This article gives an overview of the results of the author’s PhD thesis Schlechte [2012]. The thesis deals with the mathematical optimization for the efficient use of railway infrastructure. We address the optimal allocation of the available railway track capacity the track allocation problem. This track allocation problem is a major challenge for a railway company, independent of whether a fr...
متن کاملSolving Railway Track Allocation Problems
The optimal track allocation problem (OPTRA), also known as the train routing problem or the train timetabling problem, is to find, in a given railway network, a conflict-free set of train routes of maximum value. We propose a novel integer programming formulation for this problem that is based on additional ‘configuration’ variables. Its LP-relaxation can be solved in polynomial time. These re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Structure and Infrastructure Engineering
سال: 2019
ISSN: 1573-2479,1744-8980
DOI: 10.1080/15732479.2019.1629464